An Algorithm for Traffic Equilibrium Flow with Capacity Constraints of Arcs
نویسندگان
چکیده
In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.
منابع مشابه
Essential Components of the Solution Set for Multiclass Multicriteria Traffic Equilibrium Problems
Wardrop [1] introduced the famous user equilibrium principle for traffic network, which is a scalar equilibrium principle. Smith [2] investigated that a Wardrop's user equilibrium flow is equivalent to the solution of a class of variational inequalities when the travel cost function is a scalar function. Recently, many researchers have proposed equilibrium models based on multicriteria consider...
متن کاملTraffic Network Equilibrium Problems with Capacity Constraints of Arcs and Linear Scalarization Methods
Traffic network equilibrium problems with capacity constraints of arcs are studied. A weak vector equilibrium principle with vector-valued cost functions, which are different from the ones in the work of Lin 2010 , and three kinds of parametric equilibrium flows are introduced. Some necessary and sufficient conditions for a weak vector equilibrium flow to be a parametric equilibrium flow are de...
متن کاملAn implicit path enumeration model and algorithm for dynamic traffic assignment with congestion spillback
A new continuous formulation of Dynamic Traffic Assignment, where a user equilibrium is expressed as a fixed point problem in terms of arc flow temporal profiles, is proposed. The precise aim of the paper is to integrate spillback modelling into an existing formulation of DTA, based on implicit path enumeration, which is capable of representing explicitly the formation and dispersion of vehicle...
متن کاملSpillback congestion in dynamic traffic assignment : a macroscopic flow model with time - varying bottlenecks
In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks in which we explicitly address the simulation of queue spillovers where a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing for...
متن کاملMultiple Commodity Flow Problem with Unreliable Nodes subject to Budget Constraints
Many real life systems such as manufacturing, telecommunication, computers, and urban traffic systems can be modeled as capacitated-flow networks. The reliability and unreliability are two important indices to measure the quality level for a capacitated-flow network. For a multiple commodity (different types of commodity) capacitated-flow network with unreliable nodes, the arcs and nodes all ha...
متن کامل